Growth Rates of Groups associated with Face 2-Coloured Triangulations and Directed Eulerian Digraphs on the Sphere
نویسنده
چکیده
Let G be a properly face 2-coloured (say black and white) piecewise-linear triangulation of the sphere with vertex set V . Consider the abelian group AW generated by the set V , with relations r+c+s = 0 for all white triangles with vertices r, c and s. The group AB can be defined similarly, using black triangles. These groups are related in the following manner AW ∼= AB ∼= Z⊕ Z⊕ C where C is a finite abelian group. The finite torsion subgroup C is referred to as the canonical group of the triangulation. Let mt be the maximal order of C over all properly face 2-coloured spherical triangulations with t triangles of each colour. By relating such a triangulation to certain directed Eulerian spherical embeddings of digraphs whose abelian sand-pile groups are isomorphic to the triangulation’s canonical group we provide improved upper and lower bounds for lim supt→∞(mt) 1/t.
منابع مشابه
Obstructions to directed embeddings of Eulerian digraphs in the plane
A 2-cell embedding of an Eulerian digraph in a closed surface is said to be directed if the boundary of each face is a directed closed walk in G. We prove Kuratowski-type theorems about obstructions to directed embeddings of Eulerian digraphs in the plane.
متن کامل0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملEulerian digraphs and Dyck words, a bijection
The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in both directions. The connection between Dyck words and Eulerian digraphs exploits a novel combinatorial structure: a binary matrix, we call Dyck matrix, representing the cycles of an Eulerian digraph. 1. Background, and ...
متن کاملEnumeration of digraph embeddings
A cellular embedding of an Eulerian digraph D into a closed surface is said to be directed if the boundary of each face is a directed closed walk in D. The directed genus polynomial of an Eulerian digraph D is the polynomial ΓD(x) = ∑ h≥0 gh(D)x h where gh(D) is the number of directed embeddings into the orientable surface Sh, of genus h, for h = 0, 1, . . . . The sequence {gh(D)|h ≥ 0}, which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 23 شماره
صفحات -
تاریخ انتشار 2016